On the Virtue of Succinct Proofs: Amplifying Communication Complexity Hardness to Time-Space Trade-offs in Proof Complexity [Extended Abstract] Trinh Huynh

Source URL: www.complexity.ethz.ch

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Automated theorem proving
• Logic in computer science
• Rules of inference
• Resolution
• Proof complexity
• Conflict-Driven Clause Learning
• Boolean algebra
• Exponential time hypothesis
• PP

Running Head: HOW LANGUAGE PROGRAMS THE MIND How language programs the mind Pardon all the typos. Corrected Proof Coming Soon!

Source URL: sapir.psych.wisc.edu

• Cognition
• Neuropsychology
• Cognitive science
• Educational psychology
• Neuropsychological assessment
• Semantics
• Concept learning
• Learning theory
• Learning
• Educational technology
• Concept
• ACT-R

RAC
 Rev. R. Acad. Cien. Serie A. Mat. VOL), 2004, pp. 153–180 Ciencias de la Computaci´on / Computational Sciences

Source URL: www-i2.informatik.rwth-aachen.de

• Mathematics
• Logic
• Theoretical computer science
• Mathematical logic
• Automated theorem proving
• Type theory
• Logic in computer science
• Nqthm
• Mathematical induction
• Mathematical proof
• Recursive definition
• Induction

Proceedings of the Seventh Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software

Source URL: places14.di.fc.ul.pt

• Proof theory
• Logic in computer science

Verification of Hybrid Systems in Coq H. Geuvers, A. Koprowski, D. Synek, E. van der Weegen BRICKS AFM4 Advancing the Real use of Proof Assistants Foundations group, Intelligent Systems, ICIS Radboud University Nijmegen

Source URL: www.cs.ru.nl

• Functional languages
• Type theory
• Automated theorem proving
• Hybrid automaton
• Numerical analysis
• Proof assistant
• Coq
• Verification
• OCaml
• Model checking
• Discretization

A limited “proof by example” of Arrow’s Theorem The following example illustrates the role of each of the various axioms in proving Arrow’s Theorem. The example was taken from Positive Political Theory, Vol. I by

Source URL: www.cs.wustl.edu

Purity through Unravelling Robert Hein and Charles Stewart Technische Universit¨ at Dresden, Germany Abstract. We divide attempts to give the structural proof theory of

Source URL: www.textproof.com

Proof Theory and Mathematical Meaning of Paraconsistent C-Systems Paolo Gentilini a,b,∗ , a Istituto di Matematica Applicata e Tecnologie Informatiche del Consiglio

Source URL: www.gentilini.ge.it

Premises as Resources Johannes C. Flieger Scheme UK April 2003 Abstract Premises as resources; Weakening and Contraction; central notions

Source URL: schematics.sourceforge.net

• Logic
• Mathematical logic
• Proof theory
• Abstraction
• Non-classical logic
• Sequent
• NC
• Linear logic
• Constructible universe
• CurryHoward correspondence
• Natural deduction

2015 Knuth Prize Citation for L´ aszl´ o Babai The 2015 Donald E. Knuth Prize is awarded to L´aszl´o Babai of the University of Chicago for his fundamental contributions to theoretical computer science, including alg

Source URL: www.sigact.org

• Probabilistic complexity theory
• Theoretical computer science
• Morphisms
• Computational complexity theory
• PCP theorem
• Mathematical optimization
• Probabilistically checkable proof
• Combinatorica
• IP
• Algorithm
• Russell Impagliazzo
• Graph isomorphism